A Simplified Algorithm for Solution Classification of the Perspective-three-Point Problem
نویسنده
چکیده
Given the distance between every pair of 3 control points, and given the angle to every pair of the control points from an additional point called the Center of Perspectivity (P ), find the lengths of the segments joining the P to each of the control points. We call this the “perspective-three-point (p3p) problem”. The corresponding algebraic equation system is called the p3p equation system. So-called a solution classification of the p3p equation system is to give explicit conditions under which the system has none, one, two, ... real physical solutions, respectively. This problem had been open for many years [?, 1-8]. An efficient algorithm is presented here for such a classification under some non-degenerate conditions that gives: • The condition under which the p3p equation system has a unique real physical solution. • The conditions under which the p3p equation system has 2, 3, ... real physical solutions, respectively, provided the system has any real physical solution. The above result gives the complete classificaton (under some non-degenerate conditions) in practice because at least one real solution exists in that case. A program written in Maple was implemented on PC computers efficiently. The problem is originated from camera calibration [?]. Given the distance between every pair of 3 control points, and given the angle to every pair of the control points from an additional point called the Center of Perspectivity (P ), find the lengths of the segments joining the P to each of the control points. We call this the “perspective-three-point (p3p) problem”. The corresponding algebraic equation system y2 + z2 − 2 p y z − a2 = 0 z2 + x2 − 2 q z x− b2 = 0 x2 + y2 − 2 r x y − c2 = 0 (1) is called the p3p equation system, where a, b, c denote the distances between the control points A,B,C, parameters p, q, r denote the cosines of the angles α = 6 BPC, β = 6 CPA, γ = 6 APB, 1) This work is supported in part by CAS and CNRS under a cooperative project between CICA and LEIBNIZ, and in part by the National Climbing Project and “863” Project of China.
منابع مشابه
A SIMPLIFIED LAGRANGIAN MULTIPLIER APPROACH FOR FIXED HEAD SHORT-TERM HYDROTHERMAL SCHEDULING
This paper presents a simplifiedlagrangian multiplier based algorithm to solve the fixed head hydrothermalscheduling problem. In fixed head hydrothermal scheduling problem, waterdischarge rate is modeled as quadratic function of hydropower generation andfuel cost is modeled as quadratic function of thermal power generation. Thepower output of each hydro unit varies with the rate of water discha...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کاملIntelligent Tuned Harmony Search for Solving Economic Dispatch Problem with Valve-point Effects and Prohibited Operating Zones
Economic dispatch with valve point effect and Prohibited Operating Zones (POZs) is a non-convex and discontinuous optimization problem. Harmony Search (HS) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. The performances of these variants are severely affected by selection of different parameters of the algorithm. Intel...
متن کامل